全文获取类型
收费全文 | 267篇 |
免费 | 94篇 |
国内免费 | 10篇 |
出版年
2023年 | 4篇 |
2022年 | 7篇 |
2021年 | 5篇 |
2020年 | 11篇 |
2019年 | 3篇 |
2018年 | 8篇 |
2017年 | 16篇 |
2016年 | 20篇 |
2015年 | 15篇 |
2014年 | 23篇 |
2013年 | 24篇 |
2012年 | 21篇 |
2011年 | 24篇 |
2010年 | 13篇 |
2009年 | 18篇 |
2008年 | 18篇 |
2007年 | 19篇 |
2006年 | 22篇 |
2005年 | 24篇 |
2004年 | 16篇 |
2003年 | 8篇 |
2002年 | 8篇 |
2001年 | 10篇 |
2000年 | 13篇 |
1999年 | 7篇 |
1998年 | 10篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1991年 | 1篇 |
排序方式: 共有371条查询结果,搜索用时 31 毫秒
91.
92.
93.
We consider parallel‐machine scheduling with a common server and job preemption to minimize the makespan. While the non‐preemptive version of the problem is strongly NP‐hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP‐hard even if there is a fixed number of machines. We give a pseudo‐polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP‐hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 388–398, 2017 相似文献
94.
针对云平台上有向无环图科学应用执行容易产生虚拟机资源过剩、资源使用率低及费用虚高的问题,给出一种基于关键路径截取的有向无环图应用调度算法。该算法采取关键路径截取技术,循环找出最晚完成的未分配任务,从该任务出发,在所有未分配任务构成的图中找出最大连通子图,并计算该子图的关键路径,然后将关键路径上的任务集调度到性能匹配的虚拟机上执行;同时通过任务回填技术充分利用虚拟机的空闲时间槽,提高资源使用率。实验结果表明,在云计算平台上,该算法不仅能够在截止时间内完成有向无环图科学应用,而且可以提高资源使用率,有效减少完成该应用所需整体费用。 相似文献
95.
在介绍天基预警系统作战流程,以及天基预警系统资源和任务的分析和描述的基础上,提出天基预警系统资源调度问题,给出其输入输出结构,并以五元组的形式对该问题进行形式化描述。
关键词:天基预警系统、资源调度、形式化描述 相似文献
96.
Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations 下载免费PDF全文
We study a single batching machine scheduling problem with transportation and deterioration considerations arising from steel production. A set of jobs are transported, one at a time, by a vehicle from a holding area to the single batching machine. The machine can process several jobs simultaneously as a batch. The processing time of a job will increase if the duration from the time leaving the holding area to the start of its processing exceeds a given threshold. The time needed to process a batch is the longest of the job processing times in the batch. The problem is to determine the job sequence for transportation and the job batching for processing so as to minimize the makespan and the number of batches. We study four variations (P1, P2, P3, P4) of the problem with different treatments of the two criteria. We prove that all the four variations are strongly NP‐hard and further develop polynomial time algorithms for their special cases. For each of the first three variations, we propose a heuristic algorithm and analyze its worst‐case performance. For P4, which is to find the Pareto frontier, we provide a heuristic algorithm and an exact algorithm based on branch and bound. Computational experiments show that all the heuristic algorithms perform well on randomly generated problem instances, and the exact algorithm for P4 can obtain Pareto optimal schedules for small‐scale instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 269–285, 2014 相似文献
97.
The ‘resource curse’ is the paradoxical theory frequently used to explain how a seemingly desirable asset, such as oil, can actually pervert an economy, erode governance, perpetuate conflict, and ruin local communities to the extent that it becomes a curse. New oil discoveries in western Ghana and western Uganda have raised concerns for the democratic prospects and future stability of these countries and their surrounding regions. Based on field interviews in these oil-producing regions, this report summarises how local communities have been affected thus far and their concerns for the future. The authors assess the extent to which each country is vulnerable to oil-induced instability, and identify groups or communities that would be most likely to perpetuate it. Lastly, it provides some assessment of the future trajectory of each country. 相似文献
98.
Nicholas Owen 《Defence and Peace Economics》2013,24(4):269-288
In fiscal year 1999, the US Air Force introduced a bonus program designed to encourage longer enlistment terms. This regime shift provides a unique opportunity to estimate the elasticity of labor supply at a new margin: the length of the employment contract. A $5000 bonus differential is estimated to increase the probability that a recruit will choose a 6‐year enlistment over a 4‐year enlistment by 30 percentage points. The program is found to be cost‐effective relative to other policies to increase man‐years. 相似文献
99.
Ordered flow shop models have appeared in the literature since the mid‐1970s and proportionate flow shop models have appeared since the early 1980s. We provide a detailed review of these models along with some analysis and potential topics for future research. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013 相似文献
100.
维修资源是实施装备维修工作的物质基础和重要保证,无论是平时训练还是战时抢修,维修资源都占据着十分重要的地位,不仅影响着装备的寿命周期费用(Life Cycle Costs,LCC),还直接影响着装备的战备完好率以及部队战斗力的保持和恢复.应用更加科学高效的方法确定保障资源,是维修决策面临的重要问题之一.据此,着眼于部队装备维修保障现状需求,将维修任务分配与保障资源需求紧密结合,提出了保障资源确定分析流程,并对分析过程中的关键技术进行了相应的研究,建立了典型的维修决策模型,优化了保障资源配置.最后开发了计算机辅助决策分析系统,为维修资源的优化配置起到了很好的辅助决策作用. 相似文献